The enumeration of certain run length sequences
نویسندگان
چکیده
منابع مشابه
Run Vector Analysis and Barker Sequences of Odd Length
The run vector of a binary sequence reflects the run structure of the sequence, which is given by the set of all substrings of the run length encoding. The run vector and the aperiodic autocorrelations of a binary sequence are strongly related. In this paper, we analyze the run vector of skew-symmetric binary sequences. Using the derived results we present a new and different proof that there e...
متن کاملEnumeration of certain binary vectors
In 1986, W. S. Griffith [2] proposed reliability model and described a Markov chain approach for computing the reliability in the system. F. K. Hwang and S. Papastavridis gave a closed-form formula for this reliability in 1991, by counting the number of n-dimensional binary vectors containing exactly k non-overlapping m-tuples of consecutive ones. In 1988, T. M. Apostol [1] established recursiv...
متن کاملOn the enumeration of certain weighted graphs
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a bipartite graph, then its generating function is of the form p(x) (1−x)m+1 , where m is the number of vertices of the graph and p(x) is a polynomial of degree at mo...
متن کاملEnumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کاملEnumeration of Certain Classes of Antichains
An antichain is here regarded as a hypergraph that satisfies the following property: neither of every two different edges is a subset of the other one. The paper is devoted to the enumeration of antichains given on an n-set and having one or more of the following properties: being labeled or unlabeled; being ordered or unordered; being a cover (or a proper cover); and finally, being a T0-, T1or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1982
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(82)90591-5